Parallel Interior-Point Method for Linear and Quadratic Programs with Special Structure
نویسندگان
چکیده
This paper concerns the use of iterative solvers in interiorpoint methods for linear and quadratic programming problems. We state an adaptive termination rule for the inner iterative scheme and we prove the global convergence of the obtained algorithm, exploiting the theory developed for inexact Newton methods. This approach is promising for problems with special structure on parallel computers. We present an application on Cray T3E 256 and SGI Origin 2000 64 arising in stochastic linear programming and robust optimization, where the constraint matrix is block-angular and extremely large.
منابع مشابه
Parallel interior-point solver for structured quadratic programs: Application to financial planning problems
Issues of implementation of a library for parallel interior-point methods for quadratic programming are addressed. The solver can easily exploit any special structure of the underlying optimization problem. In particular, it allows a nested embedding of structures and by this means very complicated real-life optimization problems can be modeled. The efficiency of the solver is illustrated on se...
متن کاملAn Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملParallel interior-point solver for structured linear programs
Issues of implementation of an object-oriented library for parallel interior-point methods are addressed. The solver can easily exploit any special structure of the underlying optimization problem. In particular, it allows a nested embedding of structures and by this means very complicated real-life optimization problems can be modelled. The efficiency of the solver is illustrated on several pr...
متن کاملA Parallel Interior Point Method for Stochastic Linear Programs
This paper describes a parallel implementation of the primal-dual interior point method for a special class of large linear programs that occur in stochastic linear programming. The method used by Vanderbei and Carpenter [31] for removing dense columns is modi ed to eliminate variables which link blocks in stochastic linear programs. The algorithm developed was tested on six test problems from ...
متن کاملAn improved infeasible interior-point method for symmetric cone linear complementarity problem
We present an improved version of a full Nesterov-Todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (Bull. Iranian Math. Soc., 40(3), 541-564, (2014)). In the earlier version, each iteration consisted of one so-called feasibility step and a few -at most three - centering steps. Here, each iteration consists of only a feasibility step. Thus, the new...
متن کامل